DRCHEF Doctor Chef - CodeChef Solution

t = int(input())


def find(x, i):
    ans = 1

    while x < i:
        x = x * 2
        ans += 1
    return ans, i*2




for _ in range(t):
    n, x = map(int, input().split())
    s = list(map(int , input().split()))
    s.sort()

    if s.count(s[0]) == n:
        a, b = find(x, s[0])

        print(a + n-1)
        continue

    ind = -1

    count = 0


    for i in range(len(s)):
        if x<= s[i]:
            ind = i
            break

    if ind==-1:
        print(n)
        continue

    if ind!=0:
        ind-=1


    for i in range(ind, len(s)):

        if s[i]  * 2 <= x:
            count+=1
            continue

        b, x = find(x, s[i])

        count+=b

    print(count + ind)